Generalised Twisted Gabidulin Codes
نویسندگان
چکیده
We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes.
منابع مشابه
Generalized Twisted Gabidulin Codes
Based on the twisted Gabidulin codes obtained recently by Sheekey, we construct a new family of maximal rank distance codes as a set of qpolynomials over Fqn , which includes the generalized Gabidulin codes and the twisted Gabidulin codes. Their Delsarte duals and adjoint codes are investigated. We also obtain necessary and sufficient conditions for the equivalence between two members of our ne...
متن کاملNuclei and automorphism groups of generalized twisted Gabidulin codes
Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes over finite fields. As a subset of m×n matrices, when m = n, the automorphism group of any generalized twisted Gabidulin code has been completely determined by the authors in [14]. In this paper, we consider the same problem for m < n. Under certain conditions on their parameters, we determine the...
متن کاملA Decoding Algorithm for Rank Metric Codes
In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also i...
متن کاملSolving Shift Register Problems over Skew Polynomial Rings using Module Minimisation
For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error and erasure decoding of `-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity O(`μ) where μ measures the size of...
متن کاملRow reduction applied to decoding of rank-metric and subspace codes
We show that error and erasure decoding of `-Interleaved Gabidulin codes, as well as list-` decoding of Mahdavifar–Vardy codes can be solved by row reducing skew polynomial matrices. Inspired by row reduction of F[x] matrices, we develop a general and flexible approach of transforming matrices over skew polynomial rings into certain normal forms. We apply this to solve generalised shift registe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.08093 شماره
صفحات -
تاریخ انتشار 2017